Line digraphs and coreflexive vertex sets

The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection digraph from a given digraph.Comment: 8 pages, 3 figure

To catch a falling robber

We consider a Cops-and-Robber game played on the subsets of an $n$-set. The robber starts at the full set; the cops start at the empty set. On each turn, the robber moves down one level by discarding an element, and each cop moves up one level by gaining an element. The question is how many cops are needed to ensure catching the robber when the robber reaches the middle level. Aaron Hill posed the problem and provided a lower bound of $2^{n/2}$ for even $n$ and $\binom{n}{\lceil n/2 \rceil}2^{-\lfloor n/2 \rfloor}$ for odd $n$. We prove an upper bound (for all $n$) that is within a factor of $O(\ln n)$ times this lower bound.Comment: Minor revision

E_11 and M Theory

We argue that eleven dimensional supergravity can be described by a non-linear realisation based on the group E_{11}. This requires a formulation of eleven dimensional supergravity in which the gravitational degrees of freedom are described by two fields which are related by duality. We show the existence of such a description of gravity.Comment: 21 pages, some typos corrected and two references adde

Extremal Values of the Interval Number of a Graph

The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vertex in $G$ there can be assigned a collection of at most $t$ finite closed intervals on the real line so that there is an edge between vertices $v$ and $w$ in $G$ if and only if some interval for $v$ intersects some interval for $w$. The well known interval graphs are precisely those graphs $G$ with $i ( G )\leqq 1$. We prove here that for any graph $G$ with maximum degree $d, i ( G )\leqq \lceil \frac{1}{2} ( d + 1 ) \rceil$. This bound is attained by every regular graph of degree $d$ with no triangles, so is best possible. The degree bound is applied to show that $i ( G )\leqq \lceil \frac{1}{3}n \rceil$ for graphs on $n$ vertices and $i ( G )\leqq \lfloor \sqrt{e} \rfloor$ for graphs with $e$ edges

E11, generalised space-time and equations of motion in four dimensions

We construct the non-linear realisation of the semi-direct product of E11 and its first fundamental representation at low levels in four dimensions. We include the fields for gravity, the scalars and the gauge fields as well as the duals of these fields. The generalised space-time, upon which the fields depend, consists of the usual coordinates of four dimensional space-time and Lorentz scalar coordinates which belong to the 56-dimensional representation of E7. We demand that the equations of motion are first order in derivatives of the generalised space-time and then show that they are essentially uniquely determined by the properties of the E11 Kac-Moody algebra and its first fundamental representation. The two lowest equations correctly describe the equations of motion of the scalars and the gauge fields once one takes the fields to depend only on the usual four dimensional space-time

Star-factors of tournaments

Let S_m denote the m-vertex simple digraph formed by m-1 edges with a common tail. Let f(m) denote the minimum n such that every n-vertex tournament has a spanning subgraph consisting of n/m disjoint copies of S_m. We prove that m lg m - m lg lg m <= f(m) <= 4m^2 - 6m for sufficiently large m.Comment: 5 pages, 1 figur